More on the power of chain rules in context-free grammars
نویسندگان
چکیده
منابع مشابه
the effect of learning strategies on the speaking ability of iranian students in the context of language institutes
the effect of learning strategies on the speaking ability of iranian students in the context of language institutes abstract language learning strategies are of the most important factors that help language learners to learn a foreign language and how they can deal with the four language skills specifically speaking skill effectively. acknowledging the great impact of learning strategies...
analysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولInference of Sequential Association Rules Guided by Context-Free Grammars
One of the main unresolved problems in data mining is related with the treatment of data that is inherently sequential. Algorithms for the inference of association rules that manipulate sequential data have been proposed and used to some extent but are ineffective, in some cases, because too many candidate rules are extracted and filtering the relevant ones is difficult and inefficient. In this...
متن کاملThe Generative Power of d-Dimensional #-Context-Free Array Grammars
The main result proved in this paper shows that the natural embedding of any one-dimensional array language in the two-dimensional space can be generated by a two-dimensional #-context-free array grammar. This result can also be extended to the two-dimensional case, and we conjecture that a similar result is true for arbitrary dimensions. Our result shows that in the array case, context-freenes...
متن کاملThe Copying Power of Well-Nested Multiple Context-Free Grammars
We prove a copying theorem for well-nested multiple contextfree languages: if L = {w#w | w ∈ L0 } has a well-nested m-MCFG, then L has a ‘non-branching’ well-nested m-MCFG. This can be used to give simple examples of multiple context-free languages that are not generated by any well-nested MCFGs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(82)90122-0